Quotient Isomorphism Invariants of a Finitely Generated Coxeter Group
نویسندگان
چکیده
The isomorphism problem for finitely generated Coxeter groups is the problem of deciding if two finite Coxeter matrices define isomorphic Coxeter groups. Coxeter [4] solved this problem for finite irreducible Coxeter groups. Recently there has been considerable interest and activity on the isomorphism problem for arbitrary finitely generated Coxeter groups. In this paper we describe a family of isomorphism invariants of a finitely generated Coxeter group W . Each of these invariants is the isomorphism type of a quotient group W/N of W by a characteristic subgroup N . The virtue of these invariants is that W/N is also a Coxeter group. For some of these invariants, the isomorphism problem of W/N is solved and so we obtain isomorphism invariants that can be effectively used to distinguish isomorphism types of finitely generated Coxeter groups. We emphasize that even if the isomorphism problem for finitely generated Coxeter groups is eventually solved, several of the algorithms described in our paper will still be useful because they are computational fast and would most likely be incorporated into an efficient computer program that determines if two finite rank Coxeter systems have isomorphic groups. In §2, we establish notation. In §3, we describe two elementary quotienting operations on a Coxeter system that yields another Coxeter system. In §4, we describe the binary isomorphism invariant of a finitely generated Coxeter group. In §5, we review some matching theorems. In §6, we describe the even isomorphism invariant of a finitely generated Coxeter group. In §7, we define basic characteristic subgroups of a finitely generated Coxeter
منابع مشابه
On the Isomorphism Problem for Finitely Generated Coxeter Groups. I Basic Matching
The isomorphism problem for finitely generated Coxeter groups is the problem of deciding if two finite Coxeter matrices define isomorphic Coxeter groups. Coxeter [3] solved this problem for finite irreducible Coxeter groups. Recently there has been considerable interest and activity on the isomorphism problem for arbitrary finitely generated Coxeter groups. In this paper, we determine some stro...
متن کاملMatching Theorems for Systems of a Finitely Generated Coxeter Group
The isomorphism problem for finitely generated Coxeter groups is the problem of deciding if two finite Coxeter matrices define isomorphic Coxeter groups. Coxeter [3] solved this problem for finite irreducible Coxeter groups. Recently there has been considerable interest and activity on the isomorphism problem for arbitrary finitely generated Coxeter groups. For a recent survey, see Mühlherr [10...
متن کاملThe Even Isomorphism Theorem for Coxeter Groups
Coxeter groups have presentations 〈S : (st)st∀s, t ∈ S〉 where for all s, t ∈ S, mst ∈ {1, 2, . . . ,∞}, mst = mts and mst = 1 if and only if s = t. A fundamental question in the theory of Coxeter groups is: Given two such “Coxeter” presentations, do they present the same group? There are two known ways to change a Coxeter presentation, generally referred to as twisting and simplex exchange. We ...
متن کاملJust-infinite Groups and Topological Full Groups of Minimal Subshifts
There does not exist an isomorphism-invariant Borel map which selects a just-infinite quotient of each infinite finitely generated group.
متن کاملThe quasiinvariants of the symmetric group
For m a non-negative integer and G a Coxeter group, we denote by QIm(G) the ring of m-quasiinvariants of G, as defined by Chalykh, Feigin, and Veselov. These form a nested series of rings, with QI0(G) the whole polynomial ring, and the limit QI∞(G) the usual ring of invariants. Remarkably, the ring QIm(G) is freely generated over the ideal generated by the invariants of G without constant term,...
متن کامل